Fast Conversion Algorithms for Orthogonal Polynomials
نویسندگان
چکیده
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduce a new algorithm of the same complexity for the converse operation.
منابع مشابه
Solving singular integral equations by using orthogonal polynomials
In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...
متن کاملFast algorithms for positive definite matrices structured by orthogonal polynomials
Positive definite matrices structured by orthogonal polynomial systems allow a Cholesky type decomposition of their inverse matrices in O(n2) steps. The algorithm presented in this paper uses the three-term recursion coefficients and the mixed moments of the involved polynomials.
متن کاملOn Hankel-like matrices generated by orthogonal polynomials
A class of matrices is studied that could be considered as Hankel matrices with respect to a system of orthogonal polynomials. It is shown that they have similar properties like classical Hankel matrices. Main attention is paid to the construction of fast and superfast algorithms. The main tool is the fact that these matrices are matrix representation of multiplication operators.
متن کاملBuckling and vibration analysis of angle -ply symmetric laminated composite plates with fully elastic boundaries
The main focus of this paper is on efficiency analysis of two kinds of approximating functions (characteristic orthogonal polynomials and characteristic beam functions) that have been applied in the Rayleigh-Ritz method to determine the non-dimensional buckling and frequency parameters of an angle ply symmetric laminated composite plate with fully elastic boundaries. It has been observed that o...
متن کاملA New Parallel Algorithm For Fast Generation of Discrete Chebyshev Polynomials
We present a new parallel algorithm for the fast generation of discrete Chebyshev polynomials. By fast we mean that the time complexity of the obtained parallel algorithm is of order O(logn), where n is the degree of the (n+1)st polynomial to be generated, and the number of available processors is assumed to be equal to a polynomial order of the input size. The parallel algorithm makes extensiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0804.2373 شماره
صفحات -
تاریخ انتشار 2008